18 research outputs found
Counting joints with multiplicities
Let be a collection of lines in and the set of
joints formed by , i.e. the set of points each of which lies in
at least 3 non-coplanar lines of . It is known that (first proved by Guth and Katz). For each joint , let the
multiplicity of be the number of triples of non-coplanar lines
through . We prove here that ,
while in the last section we extend this result to real algebraic curves of
uniformly bounded degree in , as well as to curves in parametrised
by real polynomials of uniformly bounded degree.Comment: More details in section 4. Typos corrected. The main results are
unchange
Counting joints in vector spaces over arbitrary fields
We give a proof of the "folklore" theorem that the
Kaplan--Sharir--Shustin/Quilodr\'an result on counting joints associated to a
family of lines holds in vector spaces over arbitrary fields, not just the
reals. We also discuss a distributional estimate on the multiplicities of the
joints in the case that the family of lines is sufficiently generic.Comment: Not intended for publication. References added and other minor edits
in this versio
Counting multijoints
Let , , be finite
collections of , , , respectively, lines in , and
the set of multijoints
formed by them, i.e. the set of points , each of which lies
in at least one line , for all , such that the
directions of , and span . We prove here that
,
and we extend our results to multijoints formed by real algebraic curves in
of uniformly bounded degree, as well as by curves in
parametrised by real univariate polynomials of uniformly bounded
degree. The multijoints problem is a variant of the joints problem, as well as
a discrete analogue of the endpoint multilinear Kakeya problem.Comment: 25 pages. arXiv admin note: substantial text overlap with
arXiv:1312.543
Discrete analogues of Kakeya problems
This thesis investigates two problems that are discrete analogues of two harmonic analytic
problems which lie in the heart of research in the field.
More specifically, we consider discrete analogues of the maximal Kakeya operator conjecture
and of the recently solved endpoint multilinear Kakeya problem, by effectively
shrinking the tubes involved in these problems to lines, thus giving rise to the problems
of counting joints and multijoints with multiplicities. In fact, we effectively show that,
in R3, what we expect to hold due to the maximal Kakeya operator conjecture, as
well as what we know in the continuous case due to the endpoint multilinear Kakeya
theorem by Guth, still hold in the discrete case. In particular, let L be a collection of L lines in R3 and J the set of joints formed by
L, that is, the set of points each of which lies in at least three non-coplanar lines of L.
It is known that |J| = O(L3/2) ( first proved by Guth and Katz). For each joint x β J,
let the multiplicity N(x) of x be the number of triples of non-coplanar lines through x.
We prove here that X
x2J
N(x)1=2 = O(L3=2);
while we also extend this result to real algebraic curves in R3 of uniformly bounded degree,
as well as to curves in R3 parametrized by real univariate polynomials of uniformly
bounded degree.
The multijoints problem is a variant of the joints problem, involving three finite collections
of lines in R3; a multijoint formed by them is a point that lies in (at least) three
non-coplanar lines, one from each collection.
We finally present some results regarding the joints problem in different field settings
and higher dimensions
Incidence bounds on multijoints and generic joints
A point is a joint formed by a finite collection
of lines in if there exist at least lines in
through that span . It is known that there are
joints formed by .
We say that a point is a multijoint formed by the finite
collections of lines in
if there exist at least lines through , one from each collection,
spanning . We show that there are such points for any
field and , as well as for and any .
Moreover, we say that a point is a generic joint formed
by a finite collection of lines in if each
lines of through form a joint there. We show that, for
and any , there are
generic joints formed by , each lying in lines of
. This result generalises, to all dimensions, a (very small) part
of the main point-line incidence theorem in in
\cite{Guth_Katz_2010} by Guth and Katz.
Finally, we generalise our results in to the case of
multijoints and generic joints formed by real algebraic curves.Comment: Some errors corrected. Theorem 4.4 is now slightly stronger than its
previous version. To appear in Discrete Comput. Geo
A multilinear Fourier extension identity on βn
We prove an elementary multilinear identity for the Fourier extension
operator on , generalising to higher dimensions the classical
bilinear extension identity in the plane. In the particular case of the
extension operator associated with the paraboloid, this provides a higher
dimensional extension of a well-known identity of Ozawa and Tsutsumi for
solutions to the free time-dependent Schr\"odinger equation. We conclude with a
similar treatment of more general oscillatory integral operators whose phase
functions collectively satisfy a natural multilinear transversality condition.
The perspective we present has its origins in work of Drury.Comment: To appear in Mathematical Research Letter
Joints formed by lines and a k-plane, and a discrete estimate of Kakeya type
Let be a family of lines and let be a family of -planes in where is a field. In our first result we show that the number of joints formed by a -plane in together with lines in is (||||. This is the first sharp result for joints involving higher-dimensional affine subspaces, and it holds in the setting of arbitrary fields . In contrast, for our second result, we work in the three-dimensional Euclidean space , and we establish the Kakeya-type estimate
where is the set of joints formed by ; such an estimate fails in the setting of arbitrary fields. This result strengthens the known estimates for joints, including those counting multiplicities. Additionally, our techniques yield significant structural information on quasi-extremisers for this inequality
Flow monotonicity and Strichartz inequalities
We identify complete monotonicity properties underlying a variety of
well-known sharp Strichartz inequalities in euclidean space